Multiple criteria districting problems

نویسندگان

  • Fernando Tavares-Pereira
  • José Rui Figueira
  • Vincent Mousseau
  • Bernard Roy
چکیده

Districting problems are of high importance in many different fields. Multiple criteria models seem a more adequate representation of districting problems in real-world situations. Real-life decision situations are by their very nature multidimensional. This paper deals with the problem of partitioning a territory into “homogeneous” zones. Each zone is composed of a set of elementary territorial units. A district map is formed by partitioning the set of elementary units into connected zones without inclusions. When multiple criteria are considered, the problem of enumerating all the efficient solutions for such a model is known as being NP-hard, which is why we decided to avoid using exact methods to solve large-size instances. In this paper, we propose a new method to approximate the Pareto front based on an evolutionary algorithm with local search. The algorithm presents a new solution representation and the crossover/mutation operators. Its main features are the following: it F. Tavares-Pereira ( ) Departamento de Matemática, Universidade da Beira Interior, Rua Marquês D’Ávila e Bolama, 6201-001 Covilha, Portugal e-mail: [email protected] F. Tavares-Pereira INESC—Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal F. Tavares-Pereira · J.R. Figueira · V. Mousseau · B. Roy LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75 775 Paris Cedex 16, France J.R. Figueira e-mail: [email protected] V. Mousseau e-mail: [email protected] B. Roy e-mail: [email protected] F. Tavares-Pereira · J.R. Figueira CEG-IST, Center for Management Studies, Departamento de Engenharia e Gestão, Instituto Superior Técnico, Universidade Técnica de Lisboa, Tagus Park, Av. Prof. Cavaco Silva, 2780-990 Porto Salvo, Portugal 70 Ann Oper Res (2007) 154: 69–92 deals with multiple criteria; it allows to solve large-size instances in a reasonable CPU time and generates high quality solutions. The algorithm was applied to a real-world problem, that of the Paris region public transportation. Results will be used for a discussion about the reform of its current pricing system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuous Districting Model Applied to Logistics Distribution Problems

The aim of districting problems is to get an optimized partition of a territory into smaller units, called districts or zones, subject to some side constraints such as balance, contiguity, and compactness. Logistics districting problems usuually involve additional optimization criteria and constraints. Districting problems are called continuous when the underlying space, both for facility sites...

متن کامل

The Public Transportation Network Pricing System of the Paris Region

Districting problems are of high importance in many different fields. Multiple criteria models seem a more adequate representation of districting problems in real-world situations. Real-life decision situations are by their very nature multidimensional. This paper deals with the problem of partitioning a territory into “homogeneous” zones. Each zone is composed of a set of elementary territoria...

متن کامل

The Impact of Political Geography on Wisconsin Redistricting: An Analysis of Wisconsin's Act 43 Assembly Districting Plan

This article illustrates how the relationship between political geography and the electoral bias of a districting plan, as measured by the efficiency gap, can be analyzed in a statistically rigorous manner using computer simulations of the legislative redistricting process. By generating a large number of different districting plans designed to optimize on traditional redistricting criteria, th...

متن کامل

A computational approach to unbiased districting

In the context of discrete districting problems with geographical constraints, we demonstrate that determining an (ex post) unbiased districting, which requires that the number of representatives of a party should be proportional to its share of votes, turns out to be a computationally intractable (NP-complete) problem. This raises doubts as to whether an independent jury will be able to come u...

متن کامل

Gerrymandering and Computational Redistricting

Partisan gerrymandering poses a threat to democracy. Moreover, the complexity of the districting task may exceed human capacities. One potential solution is using computational models to automate the districting process by optimising objective and open criteria, such as how spatially compact districts are. We formulated one such model that minimised pairwise distance between voters within a dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 154  شماره 

صفحات  -

تاریخ انتشار 2007